Expirable parking reservations for managing morning commute with parking space constraints

نویسندگان

  • Wei Liu
  • Hai Yang
  • Yafeng Yin
چکیده

When total parking supply in an urban downtown area is insufficient, morning commuters would choose their departure times not only to trade off bottleneck congestion and schedule delays, but also to secure a parking space. Recent studies found that an appropriate combination of reserved and unreserved parking spaces can spread the departures of those morning commuters and hence reduce their total travel cost. To further mitigate both traffic congestion and social cost from competition for parking, this study considers a parking reservation scheme with expiration times, where commuters with a parking reservation have to arrive at parking spaces for the reservation before a predetermined expiration time. We first show that if all parking reservations have the same expiration time, it is socially preferable to set the reservations to be non-expirable, i.e., without expiration time. However, if differentiated expiration times are properly designed, the total travel cost can be further reduced as compared with the reservation scheme without expiration time, since the peak will be further smoothed out. We explore socially desirable equilibrium flow patterns under the parking reservation scheme with differentiated expiration times. Finally, efficiencies of the reservation schemes are examined. 2014 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Managing Morning Commute with Parking Space Constraints in the Case of a Bi- modal Many-to-one Network

Recently, some studies examined how downtown parking space limitation re-shapes the morning commute in the case of a single origin-destination network. This paper further formulates and analyses the commuting equilibrium problem of both mode and departure time choices in a bi-modal (auto and public transit) many-to-one network. Several properties of the equilibrium under parking space constrain...

متن کامل

Autonomous Parallel Parking of a Car Based on Parking Space Detection and Fuzzy Controller

This paper develops an automatic parking algorithm based on a fuzzy logic controller with the vehicle pose for the input and the steering angle for the output. In this way some feasible reference trajectory path have been introduced according to geometric and kinematic constraints and nonholonomic constraints to simulate motion path of car. Also a novel method is used for parking space detec...

متن کامل

Modeling the morning commute for urban networks with cruising-for-parking: An MFD approach

This study focuses on the morning commute problem with explicit consideration of cruising-for-parking, and its adverse impacts on traffic congestion. The cruising-for-parking is modeled through a dynamic aggregated traffic model for networks: the Macroscopic Fundamental Diagram (MFD). Firstly, we formulate the commuting equilibrium in a congested downtown network where travelers have to cruise ...

متن کامل

Regulating vehicle sharing systems through parking reservation policies: Analysis and performance bounds

We study the regulation of one-way station-based vehicle sharing systems through parking reservation policies. We measure the performance of these systems in terms of the total excess travel time of all users caused as a result of vehicle or parking space shortages. We devise mathematical programming based bounds on the total excess travel time of vehicle sharing systems under any passive regul...

متن کامل

New "Smart Parking" System Based on Resource Allocation and Reservations

We propose a novel “smart parking” system for an urban environment. The system assigns and reserves an optimal parking space based on the driver’s cost function that combines proximity to destination and parking cost. Our approach solves a mixed-integer linear programming (MILP) problem at each decision point defined in a time-driven sequence. The solution of each MILP is an optimal allocation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014